Method and system for data demultiplexing

ABSTRACT

A method and system for demultiplexing packets of a message is provided. The demultiplexing system receives packets of a message, identifies a sequence of message handlers for processing the message, identifies state information associated with the message for each message handler, and invokes the message handlers passing the message and the associated state information. The system identifies the message handlers based on the initial data type of the message and a target data type. The identified message handlers effect the conversion of the data to the target data type through various intermediate data types.

PRIORITY CLAIM

This application is a continuation of U.S. Ser. No. 10/636,314 filed onAug. 26, 2003 which is a continuation of Ser. No. 09/474,664, now U.S.Pat. No. 6,629,163 filed on Dec. 29, 1999.

TECHNICAL FIELD

The present invention relates generally to a computer system for datademultiplexing.

BACKGROUND

The following application is incorporated by reference as if fully setforth herein: U.S. application Ser. No. 10/636,314 filed Aug. 6, 2003.

Computer systems, which are becoming increasingly pervasive, generatedata in a wide variety of formats. The Internet is an example ofinterconnected computer systems that generate data in many differentformats. Indeed, when data is generated on one computer system and istransmitted to another computer system to be displayed, the data may beconverted in many different intermediate formats before it is eventuallydisplayed. For example, the generating computer system may initiallystore the data in a bitmap format. To send the data to another computersystem, the computer system may first compress the bitmap data and thenencrypt the compressed data. The computer system may then convert thatcompressed data into a TCP format and then into an IP format. The IPformatted data may be converted into a transmission format, such as anethernet format. The data in the transmission format is then sent to areceiving computer system. The receiving computer system would need toperform each of these conversions in reverse order to convert the datain the bitmap format. In addition, the receiving computer system mayneed to convert the bitmap data into a format that is appropriate forrendering on output device.

In order to process data in such a wide variety of formats, both sendingand receiving computer systems need to have many conversion routinesavailable to support the various formats. These computer systemstypically use predefined configuration information to load the correctcombination of conversion routines for processing data. These computersystems also use a process-oriented approach ashen processing data withthese conversion routines. When using a process-oriented approach, acomputer system may create a separate process for each conversion thatneeds to take place. A computer system in certain situations, however,can be expected to receive data and to provide data in many differentformats that may not be known until the data is received. The overheadof statically providing each possible series of conversion routines isvery high. For example, a computer system that seizes as a centralcontroller for data received within a home would be expected to processdata received via telephone lines, cable TV lines, and satelliteconnections in many different formats. The central controller would beexpected to output the data to computer displays, television displays,entertainment centers, to speakers, recording devices, and so on in manydifferent formats. Moreover, since the various conversion routines maybe developed by different organizations, it may not be easy to identifythat the output format of one conversion routine is compatible with theinput format of another conversion routine.

It would be desirable to have a technique for dynamically identifying aseries of conversion routines for processing data. In addition, it wouldbe desirable to have a technique in which the output format of oneconversion routine can be identified as being compatible with the inputformat of another conversion routine. It would also be desirable tostore the identification of a series of conversion routines so that theseries can be quickly identified when data is received.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating example processing of a messageby the conversion system.

FIG. 2 is a block diagram illustrating a sequence of edges.

FIG. 3 is a block diagram illustrating components of the conversionsystem in one embodiment.

FIG. 4 is a block diagram illustrating example path data structures inone embodiment.

FIG. 5 is a block diagram that illustrates the interrelationship of thedata structures of a path.

FIG. 6 is a block diagram that illustrates the interrelationship of thedata structures associated with a session.

FIGS. 7A, 7B, and 7C comprise a flow diagram illustrating the processingof the message send routine.

FIG. 8 is a flow diagram of the demux routine.

FIG. 9 is a flow diagram of the initialize demux routine.

FIG. 10 is a flow diagram of the init end routine.

FIG. 11 is a flow diagram of a routine to get the next binding.

FIG. 12 is a flow diagram of the get key routine.

FIG. 13 is a flow diagram of the get session routine.

FIG. 14 is a flow diagram of the nail binding routine.

FIG. 15 is a flow diagram of the find path routine.

FIG. 16 is a flow diagram of the process of path hopping routine.

DETAILED DESCRIPTION

A method and system for converting a message that may contain multiplepackets from an source format into a target format. When a packet of amessage is received, the conversion system in one embodiment searchesfor and identifies a sequence of conversion routines (or more generallymessage handlers) for processing the packets of the message by comparingthe input and output formats of the conversion routines. (A message is acollection of data that is related in some way, such as stream of videoor audio data or an email message.) The identified sequence ofconversion routines is used to convert the message from the sourceformat to the target format using various intermediate formats. Theconversion system then queues the packet for processing by theidentified sequence of conversion routines. The conversion system storesthe identified sequence so that the sequence can be quickly found(without searching) when the next packet in the message is received.When subsequent packets of the message are received, the conversionsystem identifies the sequence and queues the packets for no pressing bythe sequence. Because the conversion system receives multiple messageswith different source and target formats and identifies a sequence ofconversion routines for each message, the conversion systems effectively“demultiplexes” the messages. That is, the conversion systemdemultiplexes the messages by receiving the message, identifying thesequence of conversion routines, and controlling the processing of eachmessage by the identified sequence. Moreover, since the conversionroutines may need to retain state information between the receipt of onepacket of a message and the next packet of that message, the conversionsystem maintains state information as an instance or session of theconversion routine. The conversion system routes all packets for amessage through the same session of each conversion routine so that thesame state or instance information can be used by all packets of themessage. A sequence of sessions of conversion routines is referred to asa “path.” In one embodiment, each path has a path thread associated withit for processing of each packet destined for that path.

In one embodiment, the packets of the messages are initially received by“drivers,” such as an Ethernet driver. When a driver receives a packet,it forwards the packet to a forwarding component of the conversionsystem. The forwarding component is responsible for identifying thesession of the conversion routine that should next process the packetand invoking that conversion routine. When invoked by a driver, theforwarding component may use a demultiplexing (“demux”) component toidentify the session of the first conversion routine of the path that isto process the packet and then queues the packet for processing by thepath. A path thread is associated with each path. Each path thread isresponsible for retrieving packets from the queue of its path andforwarding the packets to the forwarding component. When the forwardingcomponent is invoked by a path thread, it initially invokes the firstconversion routine in the path. That conversion routine processes thepacket and forwards the processed packet to the forwarding component,which then invokes the second conversion routine in the path. Theprocess of invoking the conversion routines and forwarding the processedpacket to the next conversion routine continues until the lastconversion routine in the path is invoked. A conversion routine maydefer invocation of the forwarding component until it aggregatesmultiple packets or may invoke the forwarding component multiple timesfor a packet once for each sub-packet.

The forwarding component identifies the next conversion routine in thepath using the demux component and stores that identification so thatthe forwarding component can quickly identify the conversion routinewhen subsequent packets of the same message are received. The demuxcomponent searches for the conversion routine and session that is tonext process a packet. The demux component then stores theidentification of the session and conversion routine as part of a pathdata structure so that the conversion system does not need to search forthe session and conversion routine when requested to demultiplexsubsequent packets of the same message. When searching for the nextconversion routine, the demux component invokes a label map getcomponent that identifies the next conversion routine. Once theconversion routine is found, the demux component identifies the sessionassociated with that message by, in one embodiment, invoking codeassociated with the conversion routine. In general, the code of theconversion routine determines what session should be associated with amessage. In certain situations, multiple messages may share the samesession. The demux component then extends the path for processing thatpacket to include that session and conversion routine. The sessions areidentified so that each packet is associated with the appropriate stateinformation. The dynamic identification of conversion routines isdescribed in U.S. patent application Ser. No. 09/304,973, filed on May4, 1999, entitled “Method and System for Generating a Mapping BetweenTypes of Data,” which is hereby incorporated by reference.

FIG. 1 is a block diagram illustrating example processing of a messageby the conversion system. The driver 101 receives the packets of themessage from a network. The driver performs any appropriate processingof the packet and invokes a message send routine passing the processedpacket along with a reference path entry 150. The message send routineis an embodiment of the forwarding component. A path is represented by aseries of path entries, which are represented by triangles. Each memberpath entry represents a session and conversion routine of the path, anda reference path entry represents the overall path. The passed referencepath entry 150 indicates to the message send routine that it is beinginvoked by a driver. The message send routine invokes the demux routine102 to search for and identify the path of sessions that is to processthe packet. The demux routine may in turn invoke the label map getroutine 104 to identify a sequence of conversion routines for processingthe packet. In this example, the label map get routine identifies thefirst three conversion routines, and the demux routine creates themember path entries 151, 152, 153 of the path for these conversionroutines. Each path entry identifies a session for a conversion routine,and the sequence of path entries 151-155 identifies a path. The messagesend routine then queues the packet on the queue 149 for the path thatis to process the packets of the message. The path thread 105 for thepath retrieves the packet from the queue and invokes the message sendroutine 106 passing the packet and an indication of the path. Themessage send routine determines that the next session and conversionroutine as indicated by path entry 151 has already been found. Themessage send routine then invokes the instance of the conversion routinefor the session. The conversion routine processes the packet and theninvokes the message send routine 107. This processing continues untilthe message send routine invokes the demux routine 110 after the packetis processed by the conversion routine represented by path entry 153.The demux routine examines the path and determines that it has no morepath entries. The demux routine then invokes the label map get routine111 to identify the conversion routines for further processing of thepacket. When the conversion routines are identified, the demux routineadds path entries 154, 155 to the path. She messages send routineinvokes the conversion routine associated with path entry 154.Eventually, the conversion routine associated with path entry 155performs the final processing for the path.

The label map get routine identifies a sequence of “edges” forconverting data in one format into another format. Each edge correspondsto a conversion routine for converting data from one format to another.Each edge is part of a “protocol” (or more generally a component) thatmay include multiple related edges. For example, a protocol may haveedges that each convert data in one format into several differentformats. Each edge has an input format and an output format. The labelmap get routine identifies a sequence of edges such that the outputformat of each edge is compatible with the input format of another edgein the sequence, except for the input format of the first edge in thesequence and the output format of the last edge in the sequence. FIG. 2is a block diagram illustrating a sequence of edges. Protocol P1includes an edge for converting format D1 to format D2 and an edge forconverting format D1 to format D3; protocol P2 includes an edge forconverting format D2 to format D5, and so on. A sequence for convertingformat D1 to format D15 is shown by the curved lines and is defined bythe address “P1:1, P2:1, P3:2, P4:7.” When a packet of data, in formatD1 is processed by this sequence, it is converted to format D15. Duringthe process the packet of data is sequentially converted to format D2,D5, and D13. The output format of protocol P2, edge 1 (i.e., P2:1) isformat D5, but the input format of P3:2 is format D10. The label map getroutine uses an aliasing mechanism by which two formats, such as D5 andD10 are identified as being compatible. The use of aliasing allowsdifferent names of the same format or compatible formats to becorrelated.

FIG. 3 is a block diagram illustrating components of the conversionsystem in one embodiment. The conversion system 300 can operate on acomputer system with a central processing unit 301, I/O devices 302, andmemory 303. The I/O devices may include an Internet connection, aconnection to various output devices such as a television, and aconnection to various input devices such as a television receiver. Themedia mapping system may be stored as instructions on acomputer-readable medium, such as a disk drive, memory, or datatransmission medium. The data structures of the media mapping system mayalso be stored on a computer-readable medium. The conversion systemincludes drivers 304, a forwarding component 305, a demux component 306,a label map get component 307, path data structures 308, conversionroutines 309, and instance data 310. Each driver receives data in asource format and forwards the data to the forwarding component. Theforwarding component identifies the next conversion routine in the pathand invokes that conversion routine to process a packet. The forwardingcomponent may invoke the demux component to search for the nextconversion routine and add that conversion routine to the path. Thedemux component may invoke the label map get component to identify thenext conversion routine to process the packet. The demux componentstores information defining the paths in the path structures. Theconversion routines store their state information in the instance data.

FIG. 4 is a block diagram illustrating example path data structures inone embodiment. The demux component identifies a sequence of “edges” forconverting data in one format into another format by invoking the labelmap get component. Each edge corresponds to a conversion routine forconverting data from one format to another. As discussed above, eachedge is part of “protocol” that may include multiple related so edges.For example, a protocol may have edges that each convert data in oneformat into several different formats. Each edge has as an input format(“input label”) and an output format (“output label”). Each rectanglerepresents a session 410, 420, 430, 440, 450 for a protocol. A sessioncorresponds to an instance of a protocol. That is, the session includesthe protocol and state information associated with that instance of theprotocol. Session 410 corresponds to a session for an Ethernet protocol;session 420 corresponds to a session for an IP protocol; and sessions430, 440, 450 correspond to sessions for a TCP protocol. FIG. 4illustrates three paths 461, 462, 463. Each path includes edges 417,421, 431. The paths share the same Ethernet session 410 and IP session420, but each path has a unique TCP session 430, 440, 450. Thus, path461 includes sessions 410, 420, and 430; path 462 includes sessions 410,420, and 440; and path 463 includes sessions 410, 420, and 450. Theconversion system represents each path by a sequence of path entrystructures. Each path entry structure is represented by a triangle.Thus, path 461 is represented by path entries 415, 425, and 433. Theconversion system represents the path entries of a path by a stack list.Each path also has a queue 471, 472, 473 associated with it. Each queuestores the messages that are to be processed by the conversion routinesof the edges of the path. Each session includes a binding (412, 422,432, 442, 452 that is represented by an oblong shape adjacent to thecorresponding edge. A binding for an edge of a session represents thosepaths that include the edge. The binding 412 indicates that three pathsare bound (or “nailed”) to edge 411 of the Ethernet session 410. Theconversion system uses a path list to track the paths that are bound toa binding. The path list of binding 412 identifies path entries 413,414, and 415.

FIG. 5 is a block diagram that illustrates the interrelationship of thedata structures of a path. Each path has a corresponding path structure501 that contains status information and pointers to a message queuestructure 502, a stack list structure 503, and a path address structure504. The status of a path can be extend, continue, or end. Each messagehandler returns a status for the path. The status of extend means thatadditional path entries should be added to the path. The status of endmeans that this path should end at this point and subsequent processingshould continue at a new path. The status of continue means that theprotocol does not care how the path is handled. In one embodiment, whena path has a status of continue, the system creates a copy of the pathand extends the copy. The message queue structure identifies themessages (or packets of a message) that are queued up for processing bythe path and identifies the path entry at where the processing shouldstart. The stack list structure contains a list of pointers to the pathentry structures 505 that comprise the path. Each path entry structurecontains a pointer to the corresponding path data structure, a pointerto a map structure 507, a pointer to a multiplex list 508, a pointer tothe corresponding path address structure, and a pointer to a memberstructure 509. A map structure identifies the output label of the edgeof the path entry and optionally a target label and a target key. Atarget key identifies the sessions associated with the protocol thatconverts the packet to the target label. (The terms “media.” “label.”and “format” are used interchangeably to refer to the output of aprotocol.) The multiplex list is used during the demux process to trackpossible next edges when a path is being identified as having more thanone next edge. The member structure indicates that the path entryrepresents an edge of a path and contains a pointer to a bindingstructure to which the path entry is associated (or “nailed”), a stacklist entry is the position of the path entry within the associated stacklist, a path list entry is the position of the path entry within theassociated path list of a binding and an address entry is the positionof the binding within the associated path address. A path address of apath identifies the bindings to which the path entries are bound. Thepath address structure contains a URL for the path, the name of the pathidentified by the address, a pointer to a binding list structure 506,and the identification of the current binding within the binding list.The URL (e.g., “protocol://tcp(0)/ip(0)/eth(0))”) identifies conversionroutines (e.g. protocols and edges) of a path in a human-readableformat. The URL (universal resource locator) includes a type field(e.g., “protocol”) followed by a sequence of items (e.g., “tcp(0)”). Thetype field specifies the format of the following information in the URL,that specifies that the type field is followed by a sequence of items.Each item identifies a protocol and an edge (e.g., the protocol is “tcp”and the edge is “0”). In one embodiment, the items of a URL may alsocontain an identifier of state information that is to be used whenprocessing a message. These URLs can be used to illustrate to a uservarious paths that are available for processing a message. The currentbinding is the last binding in the path as the path is being built. Thebinding list structure contains a list of pointers to the bindingstructures associated with the path. Each binding structure 510 containsa pointer to a session structure, a pointer to an edge structure, a key,a path list structure, and a list of active paths through the binding.The key identifies the state information for a session of a protocol. Apath list structure contains pointers to the path entry structuresassociated with the binding.

FIG. 6 is a block diagram that illustrates the interrelationship of thedata structures associated with a session. A session structure 601contains the context for the session, a pointer to a protocol structurefor the session, a pointer to a binding table structure 602 for thebindings associated with the session, and the key. The binding tablestructure contains a list of pointers to the binding structures 510 forthe session. The binding structure is described above with reference toFIG. 5. The path list structure 603 of the binding structure contains alist of pointers to path entry structures 505. The path entry structuresare described with reference to FIG. 5.

FIGS. 7A, 7B, and 7C comprise a flow diagram illustrating the processingof the message send routine. The message send routine is passed amessage along with the path entry associated with the session that lastprocessed the message. The message send routine invokes the messagehandler of the next edge in the path or queues the message forprocessing by a path. The message handler invokes the demux routine toidentify the next path entry of the path. When a driver receives amessage, it involves the message send routine passing a reference pathentry. The message send routine examines the passed path entry todetermine (1) whether multiple paths branch from the path of the passedpath entry, (2) whether the passed path entry is a reference with anassociated path, or (3) whether the passed path entry is a member with anext path entry. If multiple paths branch from the path of the passedpath entry, then the routine recursively invokes the message sendroutine for each path. If the path entry is a reference with anassociated path, then the driver previously invoked the message sendroutine, which associated a path with the reference path entry, and theroutine places the message on the queue for the path. If the passed pathentry is a member with a next path entry, then the routine invokes themessage handler (i.e., conversion routine of the edge) associated withthe next path entry. If the passed path entry is a reference without anassociated path or is a member without a next path entry, then theroutine invokes the demux routine to identify the next path entry. Theroutine then recursively invokes the messages send routine passing thatnext path entry. In decision block 701, if the passed path entry has amultiplex list, then the path branches off into multiple paths and theroutine continues at block 709, else the routine continues at block 702.A packet may be processed by several different paths. For example, if acertain message is directed to two different output devices, then themessage is processed by two different paths. Also, a message may need tobe processed by multiple partial paths when searching for a completepath. In decision block 702, if the passed path entry is a member, theneither the next path entry indicates a nailed binding or the path needsto be extended and the routine continues at block 704, else the routinecontinues at block 703. A nailed binding is a binding (e.g., edge andprotocol) is associated with a session. In decision block 703, thepassed path entry is a reference and if the passed path entry has anassociated path, then the routine can queue the message for theassociated path and the routine continues at block 703A, else theroutine needs to identify a path and the routine continues at block 707.In block 703A, the routine sets the entry to the first path entry in thepath and continues at block 717. In block 704, the routine sets thevariable position to the stack list entry of the passed path entry. Indecision block 705, the routine sets the variable next entry to the nextpath entry in the path. If there is a next entry in the path, then thenext session and edge of the protocol have been identified and theroutine continues at block 706, else the routine continues at block 707.In block 706, the routine passes the message to the message handler ofthe edge associated with the next entry and then returns. In block 706,the routine invokes the demux routine passing the passed message, theaddress of the passed path entry, and the passed path entry. The demuxroutine returns a list of candidate paths for processing of the message.In decision block 708, if at least one candidate path is returned, thenthe routine continues at block 709, else the routine returns.

Blocks 709-716 illustrate the processing of a list of candidate pathsthat extend from the passed path entry. In blocks 710-716, the routineloops selecting each candidate path and sending the message to beprocess by each candidate path. In block 710, the routine sets the nextentry to the first path entry of the next candidate path. In decisionblock 711, if all the candidate paths have not yet been processed, thenthe routine continues at block 712, else the routine returns. Indecision block 712, if the next entry is equal to the passed path entry,then the path is to be extended and the routine continues at block 705,else the routine continues at block 713. The candidate paths include afirst path entry that is a reference path entry for new paths or that isthe last path entry of a path being extended. In decision block 713, ifthe number of candidate paths is greater than one, then the routinecontinues at block 714, else the routine continues at block 718. Indecision block 714, if the passed path entry has a multiplex listassociated with it, then the routine continues at block 716, else theroutine continues at block 715. In block 715, the routine associates thelist of candidate path with the multiplex list of the passed path entryand continues at block 716. In block 716, the routine sends the messageto the next entry by recursively invoking the message send routine. Theroutine then loops to block 710 to select the next entry associated withthe next candidate path.

Blocks 717-718 are performed when the passed path entry is a referencepath entry that has a path associated with it. In block 717, if there isa path associated with the next entry, then the routine continues atblock 718, else the routine returns. In block 718, the routine queuesthe message for the path of the next entry and then returns.

FIG. 8 is a flow diagram of the demux routine. This routine is passedthe packet (message) that is received, an address structure, and a pathentry structure. The demux routine extends a path, creating one ifnecessary. The routine loops identifying the next binding (edge andprotocol) that is to process the message and “nailing” the binding, to asession for the message, if not already nailed. After identifying thenailed binding, the routine searches for the shortest path through thenailed binding, creating a path if none exists. In block 801, theroutine invokes the initialize demux routine. In blocks 802-810, theroutine loops identifying a path or portion of a path for processing thepassed message. In decision block 802, if there is a current status,which was returned by the demux routine that was last invoked (e.g.,continue, extend, end, or postpone), then the routine continues at block803, else the routine continues at block 811. In block 803, the routineinvokes the get next binding routine. The get next binding routinereturns the next binding in the path. The binding is the edge of aprotocol. That routine extends the path as appropriate to include thebinding. The routine returns a return status of break, binding, ormultiple. The return status of binding indicates that the next bindingin the path was found by extending the path as appropriate and theroutine continues to “nail” the binding to a session as appropriate. Thereturn status of multiple means that multiple trails (e.g., candidatepaths) were identified as possible extensions of the path. In a decisionblock 804, if the return status is break, then the routine continues atblock 811. If the return status is multiple, then the routine returns.If the return status is binding, then the routine continues at block805. In decision block 805, if the retrieved binding is nailed asindicated by being assigned to a session, then the routine loops toblock 802, else the routine continues at block 806. In block 806, theroutine invokes the get key routine of the edge associated with thebinding. The get key routine creates the key for the session associatedwith the message. If a key cannot be created until subsequent bindingsare processed or because the current binding is to be removed, then theget key routine returns a next binding status, else it returns acontinue status. In decision block 807, if the return status of the getkey routine is next binding, then the routine loops to block 802 to getthe next binding, else the routine continues at block 808. In block 808,the routine invokes the routine get session. The routine get sessionreturns the session associated with the key, creating a net session ifnecessary. In block 809, the routine invokes the routine nail binding.The routine nail binding retrieves the binding if one is already nailedto the session. Otherwise, that routine nails the binding to the tosession. In decision block 810, if the nail binding routine returns astatus of simplex, then the routine continues at block 811 because onlyone path can use the session, else the routine loops to block 802.Immediately upon return from the nail binding routine, the routine mayinvoke a set map routine of the edge passing the session and a map toallow the edge to set its map. In block 811, the routine invokes thefind path routine, which finds the shortest path through the bindinglist and creates a path if necessary. In block 812, the routine invokesthe process path hopping routine, which determines whether theidentified path is part of a different path. Path hopping occurs when,for example, IP fragments are built tip along separate paths, but oncethe fragments are built up they can be processed by the same subsequentpath.

FIG. 9 is a flow diagram of the initialize demux routine. This routineis invoked to initialize the local data structures that are used in thedemux process and to identify the initial binding. The demux routinefinds the shortest path from the initial binding to the final binding.If the current status is demux extend, then the routine is to extend thepath of the passed path entry by adding additional path entries. If thecurrent status is demux end then the demux routine is ending the currentpath. If the current status is demux continue, then the demux routine isin the process of continuing to extend or in the process of starting apath identified by the passed address. In block 901, the routine setsthe local map structure to the map structure in the passed path entrystructure. The map structure identifies the output label, the targetlabel, and the target key. In the block 902, the routine initializes thelocal message structure to the passed message structure and initializesthe pointers path and address element to null. In block 903, the routinesets of the variable saved status to 0 and the variable status to demuxcontinue. The variable saved status is used to track the status of thedemux process when backtracking to nail a binding whose nail waspostponed. In decision block 904, if the passed path entry is associatedwith a path, then the routine continues at block 905, else the routinecontinues at block 906. In block 905, the routine sets the variablestatus to the status of that path. In block 906, if the variable statusis demux continue, then the routine continues at block 907. If thevariable status is demux end, then the routine continues at block 908.If the variable status is demux extend, then the routine continues atblock 909. In block 907, the status is demux continue, and the routinesets the local pointer path address to the passed address and continuesat block 911. In block 908, the status is demux end, and the routineinvokes the init end routine and continues at block 911. In block 909,the status is demux extend, and the routine sets the local path addressto the address of the path that contains the passed path entry. In block910, the routine sets the address element and the current binding of thepath address pointed to by the local pointer path address to the addressentry of the member structure of the passed path entry. In the block911, the routine sets the local variable status to demux continue andsets the local binding list structure to the binding list structure fromthe local path address structure. In block 912, the routine sets thelocal pointer current binding to the address of the current bindingpointed to by local pointer path address and sets the local variablepostpone to 0. In block 913, the routine sets the function traverse tothe function that retrieves the next data in a list and sets the localpointer session to null. The routine then returns.

FIG. 10 is a flow diagram of the init end routine. If the path issimplex, then the routine creates a new path from where the other oneended, else the routine creates a copy of the path. In block 1001, ifthe binding of the passed path entry is simplex (i.e., only one path canbe bound to this bindings then the routine continues at block 1002, elsethe routine continues at block 1003. In block 1002, the routine sets thelocal pointer path address to point to an address structure that is acopy of the address structure associated with the passed path entrystructure with its current binding to the address entry associated withthe passed path entry structure, and then returns. In block 1003, theroutine sets the local pointer path address to point to an addressstructure that on contains the URL of the path that contains the passedpath entry. In block 1004, the routine sets the local pointer element tonull to initialize the selection of the bindings. In blocks 1005 through1007, the routine loops adding all the bindings for the address of thepassed path entry that include and are before the passed path entry tothe address pointed to by the local path address. In block 1005, theroutine retrieves the next binding from the binding list starting withthe first. If there is no such binding, then the routine returns, elsethe routine continues at block 1006. In block 1006, the routine adds thebinding to the binding list of the local path address structure and setsthe current binding of the local variable path address. In the block1007, if the local pointer element is equal to the address entry of thepassed path entry, then the routine returns, else the routine loops toblock 1005 to select the next binding.

FIG. 11 is a flow diagram of a routine to get the next binding. This toroutine returns the next binding from the local binding list. If thereis no next binding, then the routine invokes the routine label map getto identify the list of edges (“trails”) that will map the output labelto the target label. If only one trail is identified, then the bindinglist of path address is extended by the edges of the trail. If multipletrails are identified, then a path is created for each trail and theroutine returns so that the demux process can be invoked for eachcreated path. In block 1101, the routine sets the local pointer bindingto point to the next or previous (as indicated by the traverse function)binding in the local binding list. In block 1102, if a binding wasfound, then the routine returns an indication that a binding was found,else the routine continues at block 1103. In block 1103, the routineinvokes the label map get function passing the output label and targetlabel of the local map structure. The label map get function returns atrail list. A trail is a list of edges from the output label to thetarget label. In decision block 1104, if the size of the trail list isone, then the routine continues at block 1105, else the routinecontinues at block 1112. In blocks 1105-1111, the routine extends thebinding list by adding a binding data structure for each edge in thetrail. The routine then sets the local binding to the last binding inthe binding list. In block 1105, the routine sets the local pointercurrent binding to point to the last binding in the local binding list.In block 1106, the routine sets the local variable temp trail to thetrail in the trail list. In block 1107, the routine extends the bindinglist by temp trail by adding a binding for each edge in the tail. Thesebindings are not yet nailed. In block 1108, the routine sets the localbinding to point to the last binding in the local binding list. Indecision block 1119, if the local binding, does not have a key for asession and the local map has a target key for a session, then theroutine sets the key for the binding to the target key of the local mapand continues at block 1110, else the routine loops to block 1101 toretrieve the next binding in path. In block 1110, the routine sets thekey of the local binding to the target key of the local map. In block1111, the routine sets the target key of the local map to null and thenloop to block 1101 to return the next binding. In decision block 1112,if the local session is set, then the demultiplexing is already inprogress and the routine returns a break status. In block 1113, theroutine invokes a prepare multicast paths routine to prepare a pathentry for each trail in the trail list. The routine then returns amultiple status.

FIG. 12 is a flow diagram of the get key routine. The get key routineinvokes an edge's demux-key routine to retrieve a key for the sessionassociated with the to message. The key identifies the session of aprotocol. The demux key routine creates the appropriate key for themessage. The demux key routine returns a status of remove postpone, orother. The status of remove indicates that the current binding should beremoved from the path. The status of postpone indicates that the demuxkey routine cannot create the key because it needs information providedby subsequent protocols in the path. For example, a TCP session isdefined by a combination of a remote and local port address and an IPaddress. Thus, the TCP protocol postpones the creating of a key untilthe IP protocol identifies the IP address. The get kelp routine returnsa next binding status to continue at the next binding in the path.Otherwise, the routine returns a continue status. In block 1201, theroutine sets the local edge to the edge of the local binding (currentbinding) and sets the local protocol to the protocol of the local edge.In block 1202, the routine invokes the demux key routine of the localedge passing the local message, local path address, and local map. Thedemux key routine sets the key in the local binding. In decision block1203, if the demux key routine returns a status of remove, then theroutine continues at block 1204. If the demux key routine returns astatus of postpone, then the routine continues at block 1205, else theroutine continues at block 1206. In block 1204, the routine sets theflag of the local binding to indicate that the binding is to be removedand continues at block 1206. In block 1205, the routine sets thevariable traverse to the function to list the next data, increments thevariable postpone, and then returns a next binding status. In blocks1206-1214, the routine processes the postponing of the creating of akey. In blocks 1207-1210, if the creating of a key has been postponed,then the routine indicates to backtrack on the path, save the demuxstatus, and set the demux status to demux continue. In blocks 1211-1213,if the creating of a key has not been postponed, then the routineindicates to continue forward in the path and to restore any saved demuxstatus. The save demux status is the status associated by the bindingwhere the backtrack started. In decision block 1206, if the variablepostpone is set, then the routine continues at block 1207, else theroutine continues at block 1211. In block 1207, the routine decrementsthe variable postpone and sets the variable traverse to the listprevious data function. In decision block 1208, if the variable savedstatus is set, then the routine continues at block 1210, else theroutine continues at block 1209. The variable saved status contains thestatus of the demux process when the demux process started to backtrack.In block 1209, the routine sets the variable saved status to thevariable status. In block 1210, the routine sets the variable status todemux continue and continues at block 1214. In block 1211, the routinesets the variable traverse to the list next data function. In decisionblock 1212, if the variable saved status in set, then the routinecontinues at block 1213, else the routine continues at block 1214. Inblock 1213, the routine sets the variable status to the variable savedstatus and sets the variable saved status to 0. In decision block 1214,if the local binding indicates that it is to be removed, then theroutine returns a next binding status, else the routine returns acontinue status.

FIG. 13 is a flow diagram of the get session routine. This routineretrieves the session data structure, creating a data structure sessionif necessary, for the key indicated by the binding. In block 1301, theroutine retrieves the session from the session table of the localprotocol indicated by the key of the local binding. Each protocolmaintains a mapping from each key to the session associated with thekey. In decision block 1302, if there is no session, then the routinecontinues at block 1303, else the routine returns. In block 1303, theroutine creates a session for the local protocol. In block 1304, theroutine initializes the key for the local session based on the key ofthe local binding. In block 1305, the routine puts the session into thesession table of the local protocol. In block 1306, the routine invokesthe create session function of the protocol to allow the protocol toinitialize its context and then returns.

FIG. 14 is a flow diagram of the nail binding routine. This routinedetermines whether a binding is already associated with (“nailed to”)the session. If so, the routine returns that binding. If not, theroutine associates the binding with the session. The routine returns astatus of simplex to indicate that only one path can extend through thenailed binding. In decision block 1401, if the binding table of thesession contains an entry for the edge, then the routine continues atblock 1402, else the routine continues at block 1405. In block 1409, theroutine sets the binding, to the entry from the binding table of thelocal session for the edge. In block 1403, the routine sets the currentbinding to point to the binding from the session. In block 1404, if thebinding is simplex, then the routine returns a simplex status, else theroutine returns. Blocks 1405 through 1410 are performed when there is nobinding in the session for the edge. In block 1405, the routine sets thesession of the binding to the variable session. In block 1406, theroutine sets the key of the binding to the key from the session. Inblock 1407, the routine sets the entry for the edge in the binding tableof the local session to the binding. In block 1408, the routine invokesthe create binding function of the edge of the binding passing thebinding so the edge can initialize the binding. If that function returnsa status of remove, the routine continues at block 1409. In block 1409,the routine sets the binding to be removed and then returns.

FIG. 15 is a flow diagram of the find path routine. The find pathroutine identifies the shortest path through the binding list. If nosuch path exists, then the routine extends a path to include the bindinglist. In decision block 1501, if the binding is simplex and a pathalready goes through this binding (returned as an entry), then theroutine continues at block 1502, else the routine continues at block1503, in block 1502, the routine sets the path to the path of the entryand returns. In block 1503, the routine initializes the pointers elementand short entry to null. In block 1504, the routine sets the path to thepath of the passed path entry. If the local path is not null and itsstatus is demux extend, then the routine continues at block 1509, elsethe routine continues at block 1505. In blocks 1505-1508, the routineloops identifying the shortest path through the bindings in the bindinglist. The routine loops selecting each path through the binding. Theselected path is eligible if it starts at the first binding in thebinding list and the path ends at the binding. The routine loops settingthe short entry to the shortest eligible path found so far. In block1505, the routine sets the variable first binding to the first bindingin the binding list of the path address. In block 1506, the routineselects the next path (entry) in the path list of the binding startingwith the first. If a path is selected (indicating that there are morepaths in the binding), then the routine continues at block 1507, elsethe routine continues at block 1509. In block 1507, the routinedetermines whether the selected path starts at the first binding in thebinding list, whether the selected path ends at the last binding in thebinding list and whether the number of path entries in the selected pathis less than the number of path entries in the shortest path selected sofar. If these conditions are all satisfied, then the routine continuesat block 1508, else the routine loops to block 1506 to select the nextpath (entry). In block 1508, the routine sets the shortest path (shortentry) to the selected path and loops to block 1506 to select the nextpath through the binding. In block 1509, the routine sets the selectedpath (entry) to the shortest path. In decision block 1510, if a path hasbeen found, then the routine continues at block 1511, else the routinecontinues at block 1512. In block 1511, the routine sets the path to thepath of the selected path entry and returns. Blocks 1512-1516 areperformed when no paths have been found. In block 1512, the routine setsthe path to the path of the passed path entry. If the passed path entryhas a path and its status is demux extend, then the routine continues atblock 1515, else the routine continues at block 1513. In block 1513, theroutine creates a path for the path address. In block 1514, the routinesets the variable element to null and sets the path entry to the firstelement in the stack list of the path. In block 1515, the routine setsthe variable element to be address entry of the member of the passedpath entry and sets the path entry to the passed path entry. In block1516, the routine invokes the extend path routine to extend the path andthen returns. The extend path routine creates a path through thebindings of the binding list and sets the path status to the currentdemux status.

FIG. 16 is a flow diagram of the process of path hopping routine. Pathhopping occurs when the path through the binding list is not the samepath as that of the passed path entry. In decision block 1601, if thepath of the passed path entry is set, then the routine continues atblock 1602, else the routine continues at block 1609. In decision block1602, if the path of the passed path entry is equal to the local path,then the routine continues at 1612, else path hopping is occurring andthe routine continues at block 1603. In blocks 1603-1607, the routineloops positioning pointers at the first path entries of the paths thatare not at the same binding. In block 1603, the routine sets thevariable old stack to the stack list of the path of the passed pathentry. In block 1604, the routine sets the variable new stack to thestack list of the local path. In block 1605, the routine sets thevariable old element to the next element in the old stack. In block1606, the routine sets the variable element to the next element in thenew stack. In decision block 1607, the routine loops until the pathentry that is not in the same binding is located. In decision block1608, if the variable old entry is set, then the routine is not at theend of the hopped-from path and the routine continues at block 1609,else routine continues at block 1612. In block 1609, the routine setsthe variable entry to the previous entry in the hopped-to path. In block1610, the routine sets the path of the passed path entry to the localpath. In block 1611, the routine sets the local entry to the first pathentry of the stack list of the local path. In block 1612, the routineinserts an entry into return list and then returns.

Although the conversion system has been described in terms of variousembodiments, the invention is not limited to these embodiments.Modification within the spirit of the invention will be apparent tothose skilled in the art. For example, a conversion routine may be usedfor routing a message and may perform no conversion of the message.Also, a reference to a single copy of the message can be passed to eachconversion routine or demux key routine. These routines can advance thereference past the header information for the protocol so that thereference is positioned at the next header. After the demux process, thereference can be reset to point to the first header for processing bythe conversion routines in sequence. The scope of the invention isdefined by the claims that follow.

1. A method in a computer system for processing packets of a message, the method comprising: receiving a packet of the message and a data type of the message; analyzing the data type of a first packet of the message to dynamically identify a sequence of components for processing a plurality of packets of the message such that the output format of the components of the sequence match the input format of the next component in the sequence, wherein analyzing the data type of the first packet of the message to dynamically identify the sequence of components includes selecting individual components to form the sequence of components after the first packet of the message is received; storing an indication of each of the identified components so that the sequence does not need to be re-identified for subsequent packets of the message; for each of a plurality of components in the identified sequence: performing the processing of each packet by the identified component; and storing state information relating to the processing of the component with the packet for use when processing the next packet of the message.
 2. The method of claim 1 wherein the receiving of the data type includes requesting the data type from a component that previously processed the packet.
 3. The method of claim 1 wherein the component is a protocol with an edge.
 4. A method in a computer system for processing a message, the message having a plurality of headers, the method comprising: analyzing the plurality of headers of a first packet of the message to dynamically identify a sequence of components for processing a plurality of packets of the message such that the output format of the components of the sequence match the input format of the next component in the sequence, wherein analyzing the plurality of headers of the first packet of the message to dynamically identify the sequence of components includes selecting individual components to form the sequence of components after the first packet of the message is received; storing an indication of each of the identified components so that the sequence does not need to be re-identified for subsequent packets of the message; for each of a plurality of components in the identified sequence: performing the processing of each packet by the identified component; and storing state information relating to the processing of the component with the packet for use when processing the next packet of the message.
 5. The method of claim 4 wherein the analyzing includes identifying a data type associated with each of the plurality of headers.
 6. The method of claim 4 including locating state information based on information in each of the plurality of headers.
 7. The method of claim 4, further comprising receiving from the identified component an identifier of state information associated with the each of the plurality of messages.
 8. The method of claim 4 wherein analyzing the plurality of headers identifies a data type used to identify a component for processing a message.
 9. The method of claim 4 wherein analyzing the plurality of headers identifies a data type used to identify the sequence of components for processing a message.
 10. A computer readable storage medium, other than a data transmission medium, containing instructions for processing packets of a message, the instructions comprising at least one computer-executable module configured to: receive a packet of the message and a data type of the message; analyze the data type of a first packet of the message to dynamically identify a sequence of components for processing a plurality of packets of the message such that the output format of the components of the sequence match the input format of the next component in the sequence, wherein analyzing the data type of the first packet of the message to dynamically identify the sequence of components includes selecting individual components to form the sequence of components after the first packet of the message is received; store an indication of each of the identified components so that the sequence does not need to be re-identified for subsequent packets of the message; for each of a plurality of components in the identified sequence: perform the processing of each packet by the identified component; and store state information relating to the processing of the component with the packet for use when processing the next packet of the message. 